Multiplicative functions in large arithmetic progressions and applications
نویسندگان
چکیده
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: proof recent estimate by Drappeau Topacogullari arithmetical correlations; theorem ErdÅs-Wintner with support equal to the level set an additive function at shifted argument; law iterated logarithm distribution prime factors integers weighted $\tau (n-1)$ where $\tau$ denotes divisor function.
منابع مشابه
Arithmetic progressions in multiplicative groups of finite fields
Let G be a multiplicative subgroup of the prime field Fp of size |G| > p1−κ and r an arbitrarily fixed positive integer. Assuming κ = κ(r) > 0 and p large enough, it is shown that any proportional subset A ⊂ G contains non-trivial arithmetic progressions of length r. The main ingredient is the Szemerédi-Green-Tao theorem. Introduction. We denote by Fp the prime field with p elements and Fp its ...
متن کاملPrimes in Arithmetic Progressions to Large Moduli
where <p is Euler's function and n(x) counts all primes up to x. Indeed, (1.1) is known to hold, but only under the proviso that q grow more slowly than some fixed power of logx (Siegel-Walfisz theorem). Yet, for many applications, it is important to weaken this restriction. The assumption of the Generalized Riemann Hypothesis (GRH) yields (1.1) in the much wider range q < X I / 2/ log2+e x . I...
متن کاملMonochromatic Arithmetic Progressions With Large Differences
A generalisation of the van der Waerden numbers w(k;r) is considered. For a function f : Z! R + define w(k; f ;r) to be the least positive integer (if it exists) such that for every r-coloring of [1;w( f ;k;r)] there is a monochromatic arithmetic progression fa+ id : 0 i k 1g such that d f (a). Upper and lower bounds are given for w( f ;3;2). For k > 3 or r > 2, particular functions f are given...
متن کاملAlternating Sums Concerning Multiplicative Arithmetic Functions
We deduce asymptotic formulas for the alternating sums ∑ n≤x(−1)f(n) and ∑ n≤x(−1) 1 f(n) , where f is one of the following classical multiplicative arithmetic functions: Euler’s totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, ...
متن کاملPrimes in arithmetic progressions
Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-type estimates in the prime number theorem for arithmetic progressions, for all moduli k ≤ 72 and other small moduli.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2021
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8442